Robust support vector machines based on the rescaled hinge loss function

نویسندگان

  • Guibiao Xu
  • Zheng Cao
  • Bao-Gang Hu
  • José Carlos Príncipe
چکیده

The support vector machine (SVM) is a popular classifier in machine learning, but it is not robust to outliers. In this paper, based on the Correntropy induced loss function, we propose the rescaled hinge loss function which is a monotonic, bounded and nonconvex loss that is robust to outliers. We further show that the hinge loss is a special case of the proposed rescaled hinge loss. Then, we develop a new robust SVM based on the rescaled hinge loss. After using the half-quadratic optimization method, we find that the new robust SVM is equivalent to an iterative weighted SVM, which can help explain the robustness of iterative weighted SVM from a loss function perspective. Experimental results confirm that the new robust SVM not only performs better than SVM and the existing robust SVMs on the datasets that have outliers, but also presents better sparseness than SVM.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributionally-robust Approach for Finding Support Vector Machines

The classical SVM is an optimization problem minimizing the hinge losses of mis-classified samples with the regularization term. When the sample size is small or data has noise, it is possible that the classifier obtained with training data may not generalize well to population, since the samples may not accurately represent the true population distribution. We propose a distributionally-robust...

متن کامل

Robust Support Vector Machine Using Least Median Loss Penalty

It is found that data points used for training may contain outliers that can generate unpredictable disturbance for some Support Vector Machines (SVMs) classification problems. No theoretical limit for such bad influence is held in traditional convex SVM methods. We present a novel robust misclassification penalty function for SVM which is inspired by the concept of “Least Median Regression”. I...

متن کامل

Robust Truncated Hinge Loss Support Vector Machines

The support vector machine (SVM) has been widely applied for classification problems in both machine learning and statistics. Despite its popularity, however, SVM has some drawbacks in certain situations. In particular, the SVM classifier can be very sensitive to outliers in the training sample. Moreover, the number of support vectors (SVs) can be very large in many applications. To circumvent ...

متن کامل

Robustified distance based fuzzy membership function for support vector machine classification

Fuzzification of support vector machine has been utilized to deal with outlier and noise problem. This importance is achieved, by the means of fuzzy membership function, which is generally built based on the distance of the points to the class centroid. The focus of this research is twofold. Firstly, by taking the advantage of robust statistics in the fuzzy SVM, more emphasis on reducing the im...

متن کامل

A moment inequality for multicategory support vector machines

The success of support vector machines in binary classification relies on the fact that hinge loss utilized in the risk minimization targets the Bayes rule. Recent research explores some extensions of this large margin based method to the multicategory case. We obtain a moment inequality for multicategory support vector machine loss minimizers with fast rate of convergence.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2017